Fragmentation aware heuristic algorithm for routing and wavelength assignment in optical networks

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

[Proceeding] Power-Aware Routing and Wavelength Assignment in Optical Networks

We introduce the Power-Aware RWA problem, whose goal is to accommodate lightpaths in wavelength routing networks minimizing the power consumption. Formulation, algorithms, and results are presented, showing that significant power savings are possible. Introduction Wavelength Routing (WR) networks offer the flexibility of designing a “logical topology”, comprising lightpath requests, over a phys...

Multihop Routing and Wavelength Assignment Algorithm for Optical WDM Networks

We propose a new routing and wavelength assignment scheme that improves the blocking probability of WDM networks and offers a very good utilizat ion of the networks resources. This heuristic results in high quality of service, prioritization of the LAN networks and lower installat ion costs compared with the traditional RWA algorithms applied in WDM networks. It is based on the distributed Dijk...

Routing and Wavelength Assignment in Optical Networks

An efficient heuristic for routing and wavelength assignment in optical WDM networks

We propose an efficient heuristic algorithm that sets up and releases lightpaths for connection requests dynamically. We partition the routing and wavelength assignment (commonly known as RWA) problem into two subproblems and solves both of them using a well-known shortest path routing algorithm. For solving the routing subproblem, an auxiliary graph is created whereby the nodes and links in th...